Numerical Experiments on Strong Vertical Mixing under Strong Winds in the Coastal Zone
نویسندگان
چکیده
منابع مشابه
A Note on Strong Mixing
The strong mixing property for a sequence of random variables is interesting in its own right. It is discussed that under what conditions the strong mixing property holds for linear stochastic processes and in particular ARMA processes. Then an example of Non-Strong mixing Autoregressive Processes is discussed here.
متن کاملSTRONG APPROXIMATION OF THE QUANTILE PROCESSES AND ITS APPLICATIONS UNDER STRONG MIXING PROPERTIES by
Given some regularity conditions on the distribution F(.) of a random sample X h ..., Xn emanating from a strictly stationary sequence of random variables satisfying a strong mixing condition, it is shown that the sequence of quantile processes {n1hf(F1(s))(F;1(s)-F1(s)); 0 < s < I} behaves like a sequence of Brownian bridges {BD(s); 0 < s < I}. The latter is then utilized to construct (i) simu...
متن کاملSize dependence of coastal phytoplankton photosynthesis under vertical mixing conditions
We have determined the relationship between carbon-specific photosynthesis and phytoplankton cell size in a coastal ecosystem. The normalized size spectra of carbon (C) biomass and photosynthesis allow to determine both biomass and photosynthesis within any size class along the community size spectrum. By dividing the size spectra of photosynthesis and biomass, the size spectrum of C-specific p...
متن کاملWaves and Mixing in the Coastal Zone
As part of our project entitled Wind, Waves, and Mixing in the Coastal Region (AO3-379) some measurements of waves and current profiles were performed in our study site. In the Pacific coast of Baja California, a wave and current sensor, a marine radar and a meteorological station have been in operation since mid 1998. Additionaly, a current meter profiler (adp) was installed for some days in e...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society of Civil Engineers, Ser. B2 (Coastal Engineering)
سال: 2011
ISSN: 1884-2399,1883-8944
DOI: 10.2208/kaigan.67.i_321